List Of Titles

/

Change Site
GlobalView
Default Site
Research Data
Theses

Advanced Search
Expert Search

Sign In

Browse
Quick Collection

Sign In

Help
Search History
Clear Session

Showing items 1 - 2 of 2

Your selections:

NP-hard minimization

Full Text

1No 1Yes

1approximability 1bipartite graphs 1combinatorial 1computational complexity 1graphs 1undirected feedback vertex set 1vertex cover 1vertex deletion 1{0,1}-matrix

1Brankovic, Ljiljana 1Fellows, Michael R. 1Fernau, Henning 1Guo, Jiong 1Moser, Hannes 1Niedermeier, Rolf

Date

12005 12009

1Adobe Acrobat PDF

Facets

Full Text

1No 1Yes

1approximability 1bipartite graphs 1combinatorial 1computational complexity 1graphs 1undirected feedback vertex set 1vertex cover 1vertex deletion 1{0,1}-matrix

1Brankovic, Ljiljana 1Fellows, Michael R. 1Fernau, Henning 1Guo, Jiong 1Moser, Hannes 1Niedermeier, Rolf

Date

12005 12009

1Adobe Acrobat PDF

Title
Creator
Date

A complexity dichotomy for finding disjoint solutions of vertex deletion problems

- Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf

Creator: Fellows, Michael R. , Guo, Jiong , Moser, Hannes , Niedermeier, Rolf
Resource Type: conference paper
Date: 2009

Quick View

Approximability of a {0,1} - matrix problem

- Brankovic, Ljiljana, Fernau, Henning

Creator: Brankovic, Ljiljana , Fernau, Henning
Resource Type: conference paper
Date: 2005

Approximability of a {0,1} - matrix problem

Creator: Brankovic, Ljiljana , Fernau, Henning
Resource Type: conference paper
Date: 2005

1

English (Australia)
English (Australia)
Disclaimer
Privacy
Copyright
Contact
Deposit

About Vital

‹ › ×

Clear Session

Are you sure you would like to clear your session, including search history and login status?